Connectivity in random key graphs – Simple proofs for special cases
نویسندگان
چکیده
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity, and provide simple proofs for some special cases.
منابع مشابه
Eccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملMitigating Node Capture Attack in Random Key Distribution Schemes through Key Deletion
Random Key Distribution (RKD) schemes have been widely accepted to enable low-cost secure communications in Wireless Sensor Networks (WSNs). However, efficiency of secure link establishment comes with the risk of compromised communications between benign nodes by adversaries who physically capture sensor nodes. The challenge is to enhance resilience of WSN against node capture, while maintainin...
متن کاملk-Connectivity of Random Key Graphs
Random key graphs represent topologies of secure wireless sensor networks that apply the seminal Eschenauer– Gligor random key predistribution scheme to secure communication between sensors. These graphs have received much attention and also been used in diverse application areas beyond secure sensor networks; e.g., cryptanalysis, social networks, and recommender systems. Formally, a random key...
متن کاملIncidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کاملProperties of Random Graphs - Subgraph Containment
Random graphs are graphs with a fixed number of vertices, where each edge is present with a fixed probability. We are interested in the probability that a random graph contains a certain pattern, for example a cycle or a clique. A very high edge probability gives rise to perhaps too many edges (which degrades performance for many algorithms), whereas a low edge probability might result in a dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009